Cycles in enhanced hypercubes

نویسنده

  • Meijie Ma
چکیده

The enhanced hypercube Qn,k is a variant of the hypercube Qn. We investigate all the lengths of cycles that an edge of the enhanced hypercube lies on. It is proved that every edge of Qn,k lies on a cycle of every even length from 4 to 2; if k is even, every edge of Qn,k also lies on a cycle of every odd length from k+3 to 2 − 1, and some special edges lie on a shortest odd cycle of length k + 1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient VLSI Layouts of Hypercubic Networks

In this paper, we present efficient VLSI layouts of several hypercubic networks. We show that an N-node hypercube and an N-node cube-connected cycles (CCC) graph can be laid out in 4N2=9 + o(N2) and 4N2=(9log22 N) + o(N2= log2 N) areas, respectively, both of which are optimal within a factor of 1:7̄+ o(1). We introduce the multilayer grid model, and present efficient layouts of hypercubes that u...

متن کامل

Finding Lean Induced Cycles in Binary Hypercubes

Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are, however, unable to perform a complete search. In this paper, we propose an approach to finding a special class of induced cycles we call lean, based on an efficient propositional SAT encoding. Lean induced cycles dom...

متن کامل

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

We study the embedding problem of enhanced and augmented hypercubes into complete binary trees. Using tree traversal techniques, we compute minimum average edge-congestion of enhanced and augmented hypercubes into complete binary trees.

متن کامل

Multilayer VLSI Layout for Interconnection Networks

Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...

متن کامل

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

In the paper “Fault-free Mutually Independent Hamiltonian Cycles in Hypercubes with Faulty Edges” (J. Comb. Optim. 13:153–162, 2007), the authors claimed that an n-dimensional hypercube can be embedded with (n−1−f )-mutually independent Hamiltonian cycles when f ≤ n−2 faulty edges may occur accidentally. However, there are two mistakes in their proof. In this paper, we give examples to explain ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1509.04932  شماره 

صفحات  -

تاریخ انتشار 2015